Localizing Widening and Narrowing
نویسندگان
چکیده
We show two strategies which may be easily applied to standard abstract interpretation-based static analyzers. They consist in 1) restricting the scope of widening, and 2) intertwining the computation of ascending and descending chains. Using these optimizations it is possible to improve the precision of the analysis, without any change to the abstract domains.
منابع مشابه
Enhancing Top-Down Solving with Widening and Narrowing
We present an enhancement of the generic fixpoint algorithm TD which can deal with widening and narrowing even for non-monotonic systems of equations. In constrast to corresponding enhancements proposed for other standard fixpoint algorithms, no extra priorities on variables are required. Still, a mechanism can be devised so that occurrences of the widening/narrowing operator are inserted as we...
متن کاملComparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
The use of infinite abstract domains with widening and narrowing for accelerating the convergence of abstract interpretations is shown to be more powerful than the Galois connection approach re stricted to finite lattices (or lattices satisfying the chain condition).
متن کاملSimilarity solutions for slender rivulets with thermocapillarity
We use the lubrication approximation to investigate the steady flow of slender non-uniform rivulets of a viscous fluid on an inclined plane that is either heated or cooled relative to the surrounding atmosphere. Four non-isothermal situations in which thermocapillary effects play a significant role are considered. We derive the general equations for a slender rivulet subject to gravity, surface...
متن کاملComparison of the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
The use of infinite abstract domains with widening and narrowing for accelerating the convergence of abstract interpretations is shown to be more powerful than the Galois connection approach re stricted to finite lattices (or lattices satisfying the chain condition).
متن کاملWidening Polyhedra with Landmarks
The abstract domain of polyhedra is sufficiently expressive to be deployed in verification. One consequence of the richness of this domain is that long, possibly infinite, sequences of polyhedra can arise in the analysis of loops. Widening and narrowing have been proposed to infer a single polyhedron that summarises such a sequence of polyhedra. Motivated by precision losses encountered in veri...
متن کامل